package wj.d822;


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Card {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String cmdLine = scanner.nextLine();
        String[] cards = cmdLine.split(" ");
        // 1. 进行排序
        Set<String> set = new HashSet<>();
        StringBuilder sb = new StringBuilder();
        short[] flag = new short[n];
        int level = 1, idx = 0;
        while (true) {
            if (level == 1 && idx == n) {//结束退出
                return;
            } else if (idx == n) { //当前层遍历完毕



            }
        }

    }
}
